翻訳と辞書 Words near each other ・ Basic Rights Oregon ・ Basic Rocket Science ・ Basic Role-Playing ・ Basic Safety Training ・ Basic Sandwich ・ Basic science (psychology) ・ Basic sciences examination ・ Basic sediment and water ・ Basic sequential access method ・ Basic sequential algorithmic scheme ・ Basic service ・ Basic service element ・ Basic serving arrangement ・ Basic Shape ・ Basic skills ・ Basic solution (linear programming) ・ BASIC Stamp ・ Basic statistical unit (Norway) ・ Basic Statute of Oman ・ Basic Story ・ Basic Strategic Arts Program ・ Basic structure doctrine ・ Basic subgroup ・ Basic Support for Cooperative Work ・ Basic telecommunications access method ・ Basic Theology ・ Basic Training ・ Basic Training (1985 film) ・ Basic Training Honor Graduate Ribbon ・ Basic Training – Initial Military Training Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Basic solution (linear programming) ： ウィキペディア英語版 Basic solution (linear programming) In linear programming, a discipline within applied mathematics, a basic solution is any solution of a linear programming problem satisfying certain specified technical conditions. For a polyhedron $P$ and a vector $\backslash mathbf^$ * \in \mathcal^n, $\backslash mathbf^$ * is a basic solution if: # All the equality constraints defining $P$ are active at $\backslash mathbf^$ * # Of all the constraints that are active at that vector, at least $n$ of them must be linearly independent. Note that this also means that at least $n$ constraints must be active at that vector. A constraint is ''active'' for a particular solution $\backslash mathbf$ if it is satisfied at equality for that solution. A basic solution that satisfies all the constraints defining $P$ or in other words, one that lies within $P$ is called a basic feasible solution. ==References== 〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Basic solution (linear programming)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.